Complete balanced Howell rotations for 8k+5 teams
نویسندگان
چکیده
منابع مشابه
Complete Rotations in Cayley
As it is introduced by Bermond, Prennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for intercon-nection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, some optimal gossiping algorithms can be easily designed by using a comp...
متن کاملDesign of balanced MBA student teams
In some schools and universities, students from the same grade must sometimes be divided into several teams within a classroom in such a way that each team provides a good representation of the classroom population. Therefore a first problem to solve is to choose student attributes (criteria) to include into the process of designing the teams and to determine their relative importance for the s...
متن کاملCrossing numbers of complete tripartite and balanced complete multipartite graphs
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing (with edges as straight line segments) of G. Zarankiewicz proved in 1952 that cr(Kn1,n2) ≤ Z(n1, n2) := ⌊ n1 2 ⌋ ⌊ n1−1 2 ⌋ ⌊ n2 2 ⌋ ⌊ n2−1 2 ⌋ . We define an ...
متن کاملBalanced Quatrefoil Decomposition of Complete Multigraphs
Definition. Let Kn denote the complete graph of n vertices. The complete multigraph λKn is the complete graph Kn in which every edge is taken λ times. The t-foil (or the t-windmill) is a graph of t edge-disjoint K3’s with a common vertex and the common vertex is called the center of the t-foil. In particular, the 2-foil, the 3-foil, and the 4-foil are called the bowtie, the trefoil, and the qua...
متن کاملInterval colorings of complete balanced multipartite graphs
A graph G is called a complete k-partite (k ≥ 2) graph if its vertices can be partitioned into k independent sets V1, . . . , Vk such that each vertex in Vi is adjacent to all the other vertices in Vj for 1 ≤ i < j ≤ k. A complete k-partite graph G is a complete balanced kpartite graph if |V1| = |V2| = · · · = |Vk|. An edge-coloring of a graph G with colors 1, . . . , t is an interval t-colorin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90137-6